Adapting Distance Based Clustering Concept to a Heterogeneous Network
نویسندگان
چکیده
منابع مشابه
Adapting a Delay-based Protocol to Heterogeneous Environments
Adapting a Delay-based Protocol to Heterogeneous Environments. (August 2008) Kiran Kotla, B.E., Birla Institute of Technology and Science, Pilani, India Co–Chairs of Advisory Committee: Dr A. L. Narasimha Reddy Dr Riccardo Bettati We investigate the issues in making a delay-based protocol adaptive to heterogeneous environments. We assess and address the problems a delay-based protocol faces whe...
متن کاملDistance based (DBCP) Cluster Protocol for Heterogeneous Wireless Sensor Network
Clustering is an important concept to reduce the energy consumption and prolonging the life of a wireless sensor network. In heterogeneous wireless sensor network some of the nodes are equipped with more energy than the other nodes. Many routing algorithms are proposed for heterogeneous wireless sensor network. Stable Election Protocol (SEP) is one of the important protocol in this category. In...
متن کاملConcept-based Text Clustering
Thematic organization of text is a natural practice of humans and a crucial task for today’s vast repositories. Clustering automates this by assessing the similarity between texts and organizing them accordingly, grouping like ones together and separating those with different topics. Clusters provide a comprehensive logical structure that facilitates exploration, search and interpretation of cu...
متن کاملRelational Distance-Based Clustering
Work on rst-order clustering has primarily been focused on the task of conceptual clustering, i.e., forming clusters with symbolic generalizations in the given representation language. By contrast, for propositional representations, experience has shown that simple algorithms based exclusively on distance measures can often outperform their concept-based counterparts. In this paper, we therefor...
متن کاملHeterogeneous network with distance dependent connectivity
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the basic model is sharply peaked around its mean value. Since the model was originally developed to mimic the social network of acquaintances, to broaden the degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Theory and Engineering
سال: 2015
ISSN: 1793-8201
DOI: 10.7763/ijcte.2015.v7.959